منابع مشابه
Distance-regular graphs, MH-colourings and MLD-colourings
It is shown that the only bipartite distance regular graphs of diameter 3 which are MLDcolourable are the incidence graphs of complementary Hadamard designs.
متن کاملReconstruction of Random Colourings
Reconstruction problems have been studied in a number of contexts including biology, information theory and and statistical physics. We consider the reconstruction problem for random k-colourings on the ∆-ary tree for large k. Bhatnagar et. al. [1] showed non-reconstruction when ∆ ≤ 1 2 k log k − o(k log k) and reconstruction when ∆ ≥ k log k + o(k log k). We tighten this result and show nonrec...
متن کاملDiagrams Colourings and Applications
This paper reviews some results involving arc colourings in a braid or a link diagram. The left self-distributivity idendity then appears as an algebraic counterpart to Reidemeister move of type III. Using classical and less classical self-distributive operations leads to a number of different results, as well as to many open questions. It has been observed for many years that there exist a con...
متن کاملPlanting Colourings Silently
Let k ≥ 3 be a fixed integer and let Zk(G) be the number of k-colourings of the graph G. For certain values of the average degree, the random variable Zk(G(n,m)) is known to be concentrated in the sense that 1 n (lnZk(G(n,m)) − lnE[Zk(G(n,m))]) converges to 0 in probability [Achlioptas and Coja-Oghlan: Proc. FOCS 2008]. In the present paper we prove a significantly stronger concentration result...
متن کاملColourings of Planar Quasicrystals
The investigation of colour symmetries for periodic and aperiodic systems consists of two steps. The first concerns the computation of the possible numbers of colours and is mainly combinatorial in nature. The second is algebraic and determines the actual colour symmetry groups. Continuing previous work, we present the results of the combinatorial part for planar patterns with n-fold symmetry, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2016
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.11.006